1870C - Colorful Table - CodeForces Solution

#include<iostream>
using namespace std;
#define ll long long
#define pb push_back
#define R return
#include<map>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define noo cout<<"-1\n";
#define lop(i,a,n) for(ll i=a; i<n; i++)
const int N=2e5+7;
ll a[N],b[N],T=1;
map<ll,ll>mp;
void solve()
{
    mp.clear();
    ll n,k;
    cin>>n>>k;
    ll mx=0;
    for(int i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        mp[x]=1;
        b[x]=i;
        if(!a[x])a[x]=i;
        mx=max(mx,x);
    }
    for(int i=k-1;i>=1;i--)
    {
        if(!mp[i])
        {a[i]=a[i+1],b[i]=b[i+1];continue;}
        b[i]=max(b[i],b[i+1]);
        if(a[i+1])
            a[i]=min(a[i],a[i+1]);
    }
    for(int i=1;i<=k;i++)
    {
        if(mp[i])
        cout<<(b[i]-a[i]+1)*2<<' ';
        else cout<<0<<' ';
    }
    cout<<endl;
    for(int i=1;i<=k;i++)a[i]=b[i]=0;

}
int main()
{
    cin>>T;
    while(T--)
        solve();
    R 0;
}